What Is a Random String?
نویسنده
چکیده
then we would tend to believe A and would not believe B: the string u seems to be random, but the string v does not. Further on, if we change the value of a bit (say, from 1 to 0) in a (non) "random" string, then the result is still a (non) "random" string. If we keep making such changes in a "random" string, then we will eventually complete destroy randomness. Laplace [21], pp.16-17 was, in a sense, aware of the above paradox, as it may be clear from the following phrase:
منابع مشابه
What Is a Random String? 1 2
Chaitin's algorithmic de nition of random strings|based on the complexity induced by self-delimiting computers|is critically discussed. One shows that Chaitin's model satisfy many natural requirements related to randomness, so it can be considered as an adequate model for nite random objects. It is a better model than the original (Kolmogorov) proposal. Finally, some open problems will be discu...
متن کاملWhat Is a Random String ? Extended
Chaitin’s algorithmic definition of random strings—based on the complexity induced by self-delimiting computers—is critically discussed. One shows that Chaitin’s model satisfy many natural requirements related to randomness, so it can be considered as an adequate model for finite random objects. It is a better model than the original (Kolmogorov) proposal. Finally, some open problems will be di...
متن کاملMaps: creating surfaces from polygons
Roughly speaking, amap is a surface obtained by gluing a set of polygons along their edges, as is done in Figure 1. Imagine, for instance, that you are given 100 squares of paper and that you start gluing pairs of square sides until you form a surface without boundary. You have just created one of the billions of possible maps with 100 squares. We could decide to choose one of these billions of...
متن کاملMaps: creating surfaces from polygons
Roughly speaking, amap is a surface obtained by gluing a set of polygons along their edges, as is done in Figure 1. Imagine, for instance, that you are given 100 squares of paper and that you start gluing pairs of square sides until you form a surface without boundary. You have just created one of the billions of possible maps with 100 squares. We could decide to choose one of these billions of...
متن کاملانتخاب کوچکترین ابر رشته در DNA با استفاده از الگوریتم ازدحام ذرّات
A DNA string can be supposed a very long string on alphabet with 4 letters. Numerous scientists attempt in decoding of this string. since this string is very long , a shorter section of it that have overlapping on each other will be decoded .There is no information for the right position of these sections on main DNA string. It seems that the shortest string (substring of the main DNA string) i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. UCS
دوره 1 شماره
صفحات -
تاریخ انتشار 1995